Optimal leaf ordering of complete binary trees
نویسندگان
چکیده
منابع مشابه
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard in general, it becomes polynomially solvable if the set of feasible permutations is restricted to be compatible with a tree of bounded degree. We present a new algorithm for the elementary case of ordering the n leaves ...
متن کاملOptimal Three-Dimensional Layouts of Complete Binary Trees
We present optimal embeddings of an n-node complete binary tree in a three-dimensional or a two-dimensional grid when k, the size of one of the dimensions of the grid, is given. For the three-dimensional case we show how to obtain, for any k in the range [1, n/2], a layout of O(n+k logn) volume. The same bound is shown to hold for the two-dimensional case when k is in the range [log n , n/2]. W...
متن کاملOptimal Embedding of Complete Binary Trees into Lines and Grids
We consider several graph embedding problems which have a lot of important applications in parallel and distributed computing and which have been unsolved so far. Our major result is that the complete binary tree can be embedded into the square grid of the same size with almost optimal dilation (up to a very small factor). To achieve this, we rst state an embedding of the complete binary tree i...
متن کاملOptimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf spawns two new leaves. In this paper, we present simple dynamic embeddings of double-rooted comp...
متن کاملLeaf Communications in Complete Trees
One of the crucial issues associated with loosely-coupled multiprocessors based on interconnection networks is information dissemination. A number of regular communication patterns seem to cover a large portion of information dissemination requirements in practice: broadcasting, scattering/gathering, multinode broadcasting and total exchange. In this work we consider tree networks where the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2007
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.09.003